Unconstrained Methods for Generalized Complementarity Problems
نویسندگان
چکیده
In this paper, the generalized complementarity problem is formulated as an uncon-strained optimization problem. Our results generalize the results of 9]. The dimen-sionality of the unconstrained problem is the same as that of the original problem. If the mapping of generalized complementarity problem is diierentiable, the objective function of the unconstrained problem is also diierentiable. All the solutions of the original problem are global minimizers of the optimization problem. A generalized strict complementarity condition is given. Under certain assumptions, local properties of the correspondent unconstrained optimization problem are studied. Limited numerical tests are also reported.
منابع مشابه
Solution of Nonsmooth Generalized Complementarity Problems
We consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) when the underlying functions f and g are H-differentiable. We describe H-differentials of some GCP functions based on the min function and the penalized Fischer-Burmeister function, and their merit functions. Under appropriate semimonotone (E0), strictly semimonotone (E) regularity-cond...
متن کاملA neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
In this paper, we consider a neural network model for solving the nonlinear complementarity problem (NCP). The neural network is derived from an equivalent unconstrained minimization reformulation of the NCP, which is based on the generalized Fischer–Burmeister function /pða; bÞ 1⁄4 kða; bÞkp ðaþ bÞ. We establish the existence and the convergence of the trajectory of the neural network, and stu...
متن کاملAn Unconstrained Minimization Approach to the Solution of Optimization Problems with Simple Bounds
A new method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The theory presented covers Newton and Quasi-Newton methods, allows rapid changes in t...
متن کاملA Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions∗
The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun and the trust region algorithm with radius bounded below of Jiang for solving generalized complementarity problems, this paper present a new trust region algorithm with radius bounded below for the unconstrained nonsmooth optimizati...
متن کاملNonlinear complementarity as unconstrained and constrained minimization
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the penalty parameter need only be greater than one. Another feature of the unconstrained problem is that it has global minima of zero at precisely all th...
متن کامل